On bilinear systems with coinciding attainable sets
نویسندگان
چکیده
منابع مشابه
On the Continuity Properties of the Attainable Sets of Nonlinear Control Systems with Integral Constraint on Controls
The attainable sets of the nonlinear control systems with integral constraint on the control functions are considered. It is assumed that the behavior of control system is described by a differential equation which is nonlinear with respect to phase-state vector and control vector. The admissible control functions are chosen from the closed ball centered at the origin with radius μ0 in Lp t0, θ...
متن کاملOn the precision attainable with various floating-point number systems
For scientific computations on a digital computer the set of real numbers is usually approximated by a finite set F of “floating-point” numbers. We compare the numerical accuracy possible with different choices of F having approximately the same range and requiring the same word length. In particular, we compare different choices of base (or radix) in the usual floating-point systems. The empha...
متن کاملDescription of the Attainable Sets of One-Dimensional Differential Inclusions
The role played by the attainable set of a differential inclusion, in the study of dynamic control systems and fuzzy differential equations, is widely acknowledged. A procedure for estimating the attainable set is rather complicated compared to the numerical methods for differential equations. This article addresses an alternative approach, based on an optimal control tool, to obtain a descript...
متن کاملOptimal Low-Thrust, Invariant Manifold Trajectories via Attainable Sets
A method to incorporate low-thrust propulsion into the invariant manifolds technique is presented in this paper. The low-thrust propulsion is introduced by means of special attainable sets that are used in conjunction with invariant manifolds to define a first guess solution. This is later optimized in a more refined model where an optimal control formalism is used. Planar low-energy, low-thrus...
متن کاملBilinear separation of two sets inn-space
The NP-complete problem of determining whether two disjoint point sets in the n-dimensional real space R n can be separated by two planes is cast as a bilinear program, that is minimizing the scalar product of two linear functions on a polyhedral set. The bilinear program, which has a vertex solution, is processed by an iterative linear programming algorithm that terminates in a nite number of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1979
ISSN: 0022-247X
DOI: 10.1016/0022-247x(79)90292-0